Shell-polynomials and cluj-tehran index in tori t(4,4)s[5,n].
نویسندگان
چکیده
Weighted Hosoya polynomials have been developed by Diudea, in ref. Studia Univ. "Babes-Bolyai", 2002, 47, 131-139. Among various weighting schemes, those polynomials obtained by using Diudea's Shell matrix operator are far more interesting. We present here the Shell-Distance and Shell-Degree-Distance polynomials and close formulas to calculate them and derived Cluj-Tehran CT index in the family of square tiled tori T(4,4)S[5,n]. Applications of the proposed descriptors are also presented.
منابع مشابه
Counting Polynomials in Tori T(4,4)S[c,n].
A counting polynomial P(x) is a description of a graph property P(G) in terms of a sequence of numbers so that the exponents express the extent of its partitions while the coefficients are related to the number of partitions of a given extent. Basic definitions and some properties are given for two classes of polynomials, called here polynomials of vertex proximity and edge proximity, respectiv...
متن کاملTopological Compression Factors of 2-Dimensional TUC4C8(R) Lattices and Tori
We derived explicit formulae for the eccentric connectivity index and Wiener index of 2-dimensional square-octagonal TUC4C8(R) lattices with open and closed ends. New compression factors for both indices are also computed in the limit N-->∞.
متن کاملCentric connectivity index by shell matrices
Relative centricity RC values of vertices/atoms are calculated within the Distance Detour and Cluj-Distance criteria on their corresponding Shell transforms. The vertex RC distribution in a molecular graph gives atom equivalence classes, useful in interpretation of NMR spectra. Timed by vertex valences, RC provides a new index, called Centric Connectivity CC, which can be useful in the topologi...
متن کاملOn edge detour index polynomials
The edge detour index polynomials were recently introduced for computing the edge detour indices. In this paper we find relations among edge detour polynomials for the 2-dimensional graph of $TUC_4C_8(S)$ in a Euclidean plane and $TUC4C8(S)$ nanotorus.
متن کاملOmega and PIv Polynomial in Dyck Graph-like Z(8)-Unit Networks
Design of crystal-like lattices can be achieved by using some net operations. Hypothetical networks, thus obtained, can be characterized in their topology by various counting polynomials and topological indices derived from them. The networks herein presented are related to the Dyck graph and described in terms of Omega polynomial and PIv polynomials.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Acta chimica Slovenica
دوره 57 3 شماره
صفحات -
تاریخ انتشار 2010